Explicit bounds for the finite jet determination problem

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

Explicit Inapproximability Bounds for the Shortest Superstring Problem

Explicit error bounds for the α-quasi-periodic Helmholtz problem.

This paper considers a finite element approach to modeling electromagnetic waves in a periodic diffraction grating. In particular, an a priori error estimate associated with the α-quasi-periodic transformation is derived. This involves the solution of the associated Helmholtz problem being written as a product of e(iαx) and an unknown function called the α-quasi-periodic solution. To begin with...

Explicit error bounds for an adaptive finite volume scheme

A new technique for the implementation of cell-centered finite volume schemes is proposed. It is based on an equivalence between these schemes and the non-conforming Crouzeix-Raviart finite element approximation. Though the implementation somewhat increases the number of unknowns, it brings two significant advantages that make it attractive. On the one hand the resulting formulation is well-def...

Explicit Bounds for the Hausdor

A lower bound of the Hausdorr dimension of certain self-aane sets is given. Moreover, this and other known bounds such as the box dimension are expressed in terms of solutions of simple equations involving the singular values of the aanities.